-
1 подграф
section graph, subgraphРусско-английский словарь по вычислительной технике и программированию > подграф
-
2 подграф
-
3 подграф
-
4 підграф
чsection graph, subgraph -
5 подграф
section graph мат., subgraphРусско-английский научно-технический словарь Масловского > подграф
-
6 подграф
1) Mathematics: partial digraph (орграфа), partial graph, subgraph2) Information technology: section graph -
7 Teilgraph
m < edv> ■ subgraph; section graph -
8 подграф
1. section graph2. subgraph
См. также в других словарях:
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Graph factorization — Not to be confused with Factor graph. 1 factorization of Desargues graph: each color class is a 1 factor … Wikipedia
subgraph — noun A section of a graph or network … Wiktionary
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Core (graph theory) — This article is about graph homomorphisms. For the subgraph in which all vertices have high degree, see k core. In the mathematical field of graph theory, a core is a notion that describes behavior of a graph with respect to graph homomorphisms.… … Wikipedia
Prim's algorithm — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional … Wikipedia
Permanent is sharp-P-complete — The correct title of this article is Permanent is #P complete. The substitution or omission of the # sign is because of technical restrictions. In a 1979 paper Leslie Valiant proved[1] that the problem of computing the permanent of a matrix is #P … Wikipedia
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Minimum spanning tree — The minimum spanning tree of a planar graph. Each edge is labeled with its weight, which here is roughly proportional to its length. Given a connected, undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all… … Wikipedia
Structure (mathematical logic) — In universal algebra and in model theory, a structure consists of a set along with a collection of finitary operations and relations which are defined on it. Universal algebra studies structures that generalize the algebraic structures such as… … Wikipedia